51f5955c5712b5a5d2ad90d7234056d96d89ead7,src/main/java/org/highj/data/impl/treeMap/Node.java,Node,mergeEQ,#Node#Node#,398

Before Change


       if (t1.bHeight == t2.bHeight) {
           return new Node<>(RED, t1.bHeight+1, m._1(), m._2(), t1, t2_);
       } else if (t1.left.color == RED) {
           Node<K,V> newRight = new Node<>(BLACK, t1.bHeight, m._1(), m._2(), t1.right, t2_);
           return new Node<>(RED, t1.bHeight + 1, t1.key, t1.value, t1.left.turn(BLACK), newRight);
       } else {
           return new Node<>(BLACK, t1.bHeight, m._1(), m._2(), t1.turn(RED), t2_);
       }

After Change


        if (t1.bHeight == t2.bHeight) {
            return red(t1.bHeight + 1, m._1(), m._2(), t1, t2_);
        } else if (t1.left.isRed()) {
            Node<K, V> newRight = black(t1.bHeight, m._1(), m._2(), t1.right, t2_);
            return red(t1.bHeight + 1, t1.key, t1.value, t1.left.turn(BLACK), newRight);
        } else {
            return black(t1.bHeight, m._1(), m._2(), t1.turn(RED), t2_);
        }